Metric Identification of Vertices in Polygonal Cacti
نویسندگان
چکیده
The distance between two vertices u and v in a connected graph G is the number of edges lying shortest path (geodesic) them. A vertex x performs metric identification for pair (u, v) if only equality distances with implies that = (That is, different from x). minimum performing every defines dimension G. In this paper, we perform types polygonal cacti: chain cactus star cactus.
منابع مشابه
An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domains
We propose a new iterative algorithm for the computation of the vertices of a Voronoi diagram for a set of geometric objects of the euclidean plane. Each one of these vertices is the centre of the circle “touching” a triple of objects (passing through points or tangent to any other geometric object). The algorithm starts with an initial triple of points pertaining to each one of the three objec...
متن کاملGraphic vertices of the metric polytope
The metric polytope ,//~. is defined by the triangle inequalities: xij-Xik-Xjk <~ 0 and xii + Xik + Xjk ~< 2 for all triples i,j, k of(1 ..... n}. The integral vertices of ~¢¢~. are the incidence vectors of the cuts of the complete graph Kn. Therefore, ~¢~. is a relaxation of the cut polytope of K~. We study here the fractional vertices of ~¢¢~. Many of them are constructed from graphs; this is...
متن کاملAnisotropic Rectangular Metric for Polygonal Surface Remeshing
We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangleshaped polygons. Our algorithm uses a greedy optimization procedure that adds, delet...
متن کاملSimilarity of closed polygonal curves in Frechet metric
Received (received date) Revised (revised date) Communicated by (Name) The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given ...
متن کاملORDERING CACTI WITH n VERTICES AND k CYCLES BY THEIR LAPLACIAN SPECTRAL RADII
A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the first sixteen largest Laplacian spectral radii together with the corresponding graphs among all connected cacti with n vertices and k cycles, where n > 2k + 8.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences
سال: 2023
ISSN: ['1526-1492', '1526-1506']
DOI: https://doi.org/10.32604/cmes.2023.025162